CoShare: An Efficient Approach for Redundancy Allocation in NFV
نویسندگان
چکیده
An appealing feature of Network Function Virtualization (NFV) is that in an NFV-based network, a network function (NF) instance may be placed at any node. On the one hand this offers great flexibility allocation redundant instances, but on other it makes unique and difficult challenge. One particular concern there inherent correlation among nodes due to structure thus requiring special care allocation. To aim, our novel approach, called CoShare , proposed. Firstly, its design takes into consideration effect structural dependency, which might result unavailability after failure Secondly, efficiently make use resources, CoShare proposes idea xmlns:xlink="http://www.w3.org/1999/xlink">shared reservation where multiple flows allowed share same reserved backup capacity NF instance. Furthermore, factors heterogeneity nodes, instances availability requirements design. The results from number experiments conducted using realistic topologies show integration dependency allows meeting for more compared baseline approach. Specifically, able meet diverse resource-efficient manner, requiring, e.g., up 85% some studied cases, less resource overbuild than approach uses xmlns:xlink="http://www.w3.org/1999/xlink">dedicated commonly adopted redundancy NFV.
منابع مشابه
An efficient approach for solving layout problems
This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...
متن کاملA Memtic genetic algorithm for a redundancy allocation problem
Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy strategies for...
متن کاملRedundancy allocation problem for k-out-of-n systems with a choice of redundancy strategies
To increase the reliability of a specific system, using redundant components is a common method which is called redundancy allocation problem (RAP). Some of the RAP studies have focused on k-out-of-n systems. However, all of these studies assumed predetermined active or standby strategies for each subsystem. In this paper, for the first time, we propose a k-out-of-<em...
متن کاملa benchmarking approach to optimal asset allocation for insurers and pension funds
uncertainty in the financial market will be driven by underlying brownian motions, while the assets are assumed to be general stochastic processes adapted to the filtration of the brownian motions. the goal of this study is to calculate the accumulated wealth in order to optimize the expected terminal value using a suitable utility function. this thesis introduced the lim-wong’s benchmark fun...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE ACM Transactions on Networking
سال: 2022
ISSN: ['1063-6692', '1558-2566']
DOI: https://doi.org/10.1109/tnet.2021.3132279